On Analytical and Geometric Lattice Design Criteria for Wiretap Coset Codes
نویسندگان
چکیده
This paper considers physical layer security and the design of secure coset codes for wiretap channels, where information is not to be leaked to an eavesdropper having a degraded channel. The eavesdropper’s bounds for correct decoding probability and information are first revisited, and a new variant of the information bound is derived. The new bound is valid for a general channel with any fading and Gaussian noise. From these bounds, it is explicit that both the information and probability are upper bounded by the average flatness factor, i.e., the expected theta function of the faded lattice related to the eavesdropper. Taking the minimization of the average flatness factor as a design criterion, simple geometric heuristics to minimize it in the Gaussian and Rayleigh fast fading channels are motivated. It is concluded that in the Gaussian channel, the security boils down to the sphere packing density of the eavesdropper’s lattice, whereas in the Rayleigh fading channel a full-diversity well-rounded lattice with a dense sphere packing will provide the best secrecy. The proposed criteria are backed up by extensive numerical experiments.
منابع مشابه
Lattice Codes for the Gaussian Wiretap Channel
We consider the Gaussian wiretap channel, where two legitimate players Alice and Bob communicate over an additive white Gaussian noise (AWGN) channel, while Eve is eavesdropping, also through an AWGN channel. We propose a coding strategy based on lattice coset encoding. We analyze Eve’s probability of decoding, from which we define the secrecy gain as a design criterion for wiretap lattice code...
متن کاملOn the Binary Symmetric Wiretap Channel
In this paper, we investigate the binary symmetric wiretap channel. We show that the secrecy capacity can be achieved by using random linear codes. Furthermore, we explore the coset coding scheme constructed by linear codes. As a result, we give an upper bound on the total information loss, which sheds light on the design of the applicable coset codes for the secure transmission with limited in...
متن کاملPerformance of Lattice Coset Codes on a USRP Testbed
We consider an experimental setup of three USRPs that implement a wiretap channel, two USRPs are the legitimate players Alice and Bob, while the third USRP is the eavesdropper, whose position we vary to evaluate information leakage. The experimented channels are close to slow fading channels, and coset coding of lattice constellations is used for transmission, allowing to introduce controlled r...
متن کاملWiretap lattice codes from number fields with no small norm elements
We consider the problem of designing reliable and confidential lattice codes, known as wiretap lattice codes, for fast fading channels. We identify as code design criterion for finite lattice constellations a finite sum of inverse of algebraic norms, in fact the analogous for finite sums of the known criterion for infinite constellations, which motivates us to study totally real number fields w...
متن کاملCoset codes-I: Introduction and geometrical classification
Practically all known good constructive coding techniques for band-limited channels, including lattice codes and various recently proposed trellis-coded modulation schemes, can be characterized as coset codes. A coset code is defined by a lattice partition A / A and by a binary encoder C that selects a sequence of cosets of the lattice A'. The fundamental coding gain of a coset code, as well as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1609.07723 شماره
صفحات -
تاریخ انتشار 2016